Voronoi Diagrams in Linear Time ∗
نویسندگان
چکیده
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain. Since abstract Voronoi diagrams are a category of Voronoi diagrams, our algorithm works for many concrete Voronoi diagrams.
منابع مشابه
Forest-Like Abstract Voronoi Diagrams in Linear Time
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. For example, the Voronoi diagram of points in convex position, and the medial axis and constrained Voronoi diagram of a simple polygon are a tree or forest structure...
متن کاملAn Expected Linear-Time Algorithm for the Farthest-Segment Voronoi Diagram
We present linear-time algorithms to construct tree-structured Voronoi diagrams, after the sequence of their regions at infinity or along a given boundary is known. We focus on Voronoi diagrams of line segments, including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor diagram. Although tree-...
متن کاملDeletion in abstract Voronoi diagrams in expected linear time
Updating an abstract Voronoi diagram in linear time, after deletion of one site, has been an open problem for a long time. Similarly for various concrete Voronoi diagrams of generalized sites, other than points. In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion. We introduce the concept of a Voronoi-like diagram, a relaxed ver...
متن کاملLinear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures
We present linear-time algorithms to construct tree-like Voronoi diagrams with disconnected regions after the sequence of their faces along an enclosing boundary (or at infinity) is known. We focus on the farthest-segment Voronoi diagram, however, our techniques are also applicable to constructing the order-(k+1) subdivision within an order-k Voronoi region of segments and updating a nearest-ne...
متن کاملOn computing Voronoi diagrams for sorted point sets
We show that the Voronoi diagram of a nite sequence of points in the plane which gives sorted order of the points with respect to two perpendicular directions can be computed in linear time. In contrast, we observe that the problem of computing the Voronoi diagram of a nite sequence of points in the plane which gives the sorted order of the points with respect to a single direction requires (n ...
متن کامل